E ect of Job Size Characteristics on Job Scheduling Performance

A workload characteristic on a parallel computer depends on an administration policy or a user community for the computer system. An administrator of a parallel computer system needs to select an appropriate scheduling algorithm that schedules multiple jobs on the computer system e ciently. The goal of the work presented in this paper is to investigate mechanisms how job size characteristics a ect job scheduling performance. For this goal, this paper evaluates the performance of job scheduling algorithms under various workload models, each of which has a certain characteristic related to the number of processors requested by a job, and analyzes the mechanism for job size characteristics that a ect job scheduling performance signi cantly in the evaluation. The results showed that: (1) most scheduling algorithms classi ed into the rstt scheduling showed best performance and were not a ected by job size characteristics, (2) certain job size characteristics a ected performance of priority scheduling signi cantly. The analysis of the results showed that the LJF algorithm, which dispatched the largest job rst, would perfectly pack jobs to idle processors at high load, where all jobs requested power-of-two processors.